Separability of Point Sets by k-Level Linear Classification Trees
نویسندگان
چکیده
∗A preliminary version of this work appeared in the Abstracts of the 26th European Workshop on Computational Geometry, Dortmund (Germany), 2010, pp. 41–44. E. Arkin and J. Mitchell are partially supported by the National Science Foundation (CCF-0729019, CCF-1018388). D. Garijo and A. Márquez are partially supported by project MTM2008-05866-C03-01. C. Seara is partially supported by projects MTM2009-07242, Gen. Cat. DGR2009GR1040, and the ESF EUROCORES programme EuroGIGA ComPoSe IP04 MICINN Project EUI-EURC-2011-4306.
منابع مشابه
A general purpose separability criterion for classification systems
A separability criterion which can be applied to different classification algorithms is presented. It is designed to find out the best (from the point of view of separation of different classes) divisions of continuous features or the best combinations of symbolic values of discrete features. It has been tested on several datasets to construct classification decision trees and decision rules. I...
متن کاملHyperplane Separability and Convexity of Probabilistic Point Sets
We describe an O(n) time algorithm for computing the exact probability that two d-dimensional probabilistic point sets are linearly separable, for any fixed d ≥ 2. A probabilistic point in d-space is the usual point, but with an associated (independent) probability of existence. We also show that the d-dimensional separability problem is equivalent to a (d + 1)-dimensional convex hull membershi...
متن کاملDetection of some Tree Species from Terrestrial Laser Scanner Point Cloud Data Using Support-vector Machine and Nearest Neighborhood Algorithms
acquisition field reference data using conventional methods due to limited and time-consuming data from a single tree in recent years, to generate reference data for forest studies using terrestrial laser scanner data, aerial laser scanner data, radar and Optics has become commonplace, and complete, accurate 3D data from a single tree or reference trees can be recorded. The detection and identi...
متن کاملSeparability and Convexity of Probabilistic Point Sets ∗
We describe an O(n) time algorithm for computing the exact probability that two probabilistic point sets are linearly separable in dimension d ≥ 2, and prove its hardness via reduction from the k-SUM problem. We also show that d-dimensional separability is computationally equivalent to a (d+ 1)-dimensional convex hull membership problem.
متن کاملHyperspectral Image Classification Based on the Fusion of the Features Generated by Sparse Representation Methods, Linear and Non-linear Transformations
The ability of recording the high resolution spectral signature of earth surface would be the most important feature of hyperspectral sensors. On the other hand, classification of hyperspectral imagery is known as one of the methods to extracting information from these remote sensing data sources. Despite the high potential of hyperspectral images in the information content point of view, there...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Geometry Appl.
دوره 22 شماره
صفحات -
تاریخ انتشار 2012